Enumerating Up-Side Self-Avoiding Walks on Integer Lattices
نویسنده
چکیده
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. Though mathematicians have studied saws for over fifty years, the number of n-step saws is unknown. This paper examines a special case of this problem, finding the number of nstep “up-side” saws (ussaws), saws restricted to moving up and sideways. It presents formulas for the number of n-step ussaws on various lattices, found using generating functions with decomposition and recursive methods.
منابع مشابه
ar X iv : h ep - l at / 9 21 10 62 v 1 2 7 N ov 1 99 2 Algebraic Techniques for Enumerating Self - Avoiding Walks on the Square Lattice
We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of N steps is of order 3 N/4 times a polynomial in N , and so the approach is greatly superior to direct counting techniques. We have enumerated walks of up to 39 steps. As a consequence, we are able to accurately estimate the critical point, cr...
متن کاملSelf-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
We study self-avoiding and neighbour-avoiding walks and lattice trails on two semiregular lattices, the (3.122) lattice and the (4.82) lattice. For the (3.122) lattice we find the exact connective constant for both self-avoiding walks, neighbour-avoiding walks and trails. For the (4.82) lattice we generate long series which permit the accurate estimation of the connective constant for self-avoi...
متن کاملMulticanonical simulation of the Domb-Joyce model and the Go model: new enumeration methods for self-avoiding walks
We develop statistical enumeration methods for self-avoiding walks using a powerful sampling technique called the multicanonical Monte Carlo method. Using these methods, we estimate the numbers of the two dimensional N-step self-avoiding walks up to N = 256 with statistical errors. The developed methods are based on statistical mechanical models of paths which include self-avoiding walks. The c...
متن کاملSelf-avoiding walks and trails on the 3.12 lattice
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملA Monte Carlo study of non-trapped self-avoiding walks
In this paper, we study non-trapped self-avoiding walks, which are selfavoiding walks which can be extended to an infinite length. We apply the flatPERM Monte Carlo method for this purpose, generating non-trapped SAWs of length up to 1024 on the square, triangular and hexagonal lattices, and calculating their number and mean squared end-to-end distance. We find strong evidence that the growth c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 3 شماره
صفحات -
تاریخ انتشار 1996